Residual error analyses are best when independent of model runs
نویسندگان
چکیده
منابع مشابه
On Runs in Independent Sequences
Given an i.i.d. sequence of n letters from a finite alphabet, we consider the length of the longest run of any letter. In the equiprobable case, results for this run turn out to be closely related to the well-known results for the longest run of a given letter. For coin-tossing, tail probabilities are compared for both kinds of runs via Poisson approximation.
متن کاملWhen Short Runs Beat Long Runs
What will yield the best results: doing one run n generations long or doing m runs n/m generations long each? This paper presents a techniqueindependent analysis which answers this question, and has direct applicability to scheduling and restart theory in evolutionary computation and other stochastic methods. The paper then applies this technique to three problem domains in genetic programming....
متن کاملAre depressive residual symptoms independent of treatments?
Residual symptoms occur in many depressive patients after acute treatment [1]. There is growing evidence that residual symptoms are also prevalent in bipolar disorder during the euthymic phase and in unipolar depression, they are predictors of early relapse [2,3]. In long-term outcome, patients remitting from depression with residual symptoms, have more depressive symptoms and impaired social f...
متن کاملEquilibrated Residual Error Estimates are p-Robust
Equilibrated residual error estimators applied to high order finite elements are analyzed. The estimators provide always a true upper bound for the energy error. We prove that also the efficiency estimate is robust with respect to the polynomial degrees. The result is complete for tensor product elements. In the case of simplicial elements, the theorem is based on a conjecture, for which numeri...
متن کاملA Further Note on Runs in Independent Sequences
Given a sequence of letters generated independently from a finite alphabet, we consider the case when more than one, but not all, letters are generated with the highest probability. The length of the longest run of any of these letters is shown to be one greater than the length of the longest run in a particular state of an associated Markov chain. Using results of Foulser and Karlin (19...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Eos, Transactions American Geophysical Union
سال: 2014
ISSN: 0096-3941
DOI: 10.1002/2014eo370012